翻訳と辞書
Words near each other
・ Fermín Alvarado Arroyo
・ Fermín Balbuena
・ Fermín Barva
・ Fermín Cacho
・ Fermín Chávez
・ Fermín Delgado
・ Fermín Emilio Lafitte
・ Fermín Francisco de Carvajal-Vargas
・ Fermín Jáudenes
・ Fermín Lasuén
・ Fermín Martín Piera
・ Fermat curve
・ Fermat number
・ Fermat point
・ Fermat polygonal number theorem
Fermat primality test
・ Fermat Prize
・ Fermat pseudoprime
・ Fermat quintic threefold
・ Fermat quotient
・ FermaT Transformation System
・ Fermat's factorization method
・ Fermat's Last Theorem
・ Fermat's Last Theorem (book)
・ Fermat's Last Theorem in fiction
・ Fermat's little theorem
・ Fermat's principle
・ Fermat's right triangle theorem
・ Fermat's Room
・ Fermat's spiral


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Fermat primality test : ウィキペディア英語版
Fermat primality test
The Fermat primality test is a probabilistic test to determine whether a number is a probable prime.
==Concept==
Fermat's little theorem states that if ''p'' is prime and 0 < a < p, then
:a^ \equiv 1 \pmod.
If we want to test whether ''p'' is prime, then we can pick random ''as in the interval and see whether the equality holds. If the equality does not hold for a value of ''a'', then ''p'' is composite. If the equality does hold for many values of ''a'', then we can say that ''p'' is probably prime.
It might be in our tests that we do not pick any value for ''a'' such that the equality fails. Any ''a'' such that
:a^ \equiv 1 \pmod
when ''n'' is composite is known as a ''Fermat liar''. Vice versa, in this case ''n'' is called Fermat pseudoprime to base ''a''.
If we do pick an ''a'' such that
:a^ \not\equiv 1 \pmod
then ''a'' is known as a ''Fermat witness'' for the compositeness of ''n''.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Fermat primality test」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.